Characterizing Definability of Second-Order Generalized Quantifiers

نویسندگان

  • Juha Kontinen
  • Jakub Szymanik
چکیده

We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new definability and nondefinability results for second-order generalized quantifiers. In particular, we show that the monadic second-order majority quantifier Most is not definable in second-order logic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A characterization of definability of second-order generalized quantifiers with applications to non-definability

Article history: Received 14 January 2012 Received in revised form 21 February 2013 Accepted 3 February 2014 Available online 4 April 2014

متن کامل

Henkin and Function Quantifiers

Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...

متن کامل

Characterizing quantifier extensions of dependence logic

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.

متن کامل

Ramsey Theory Is Needed for Solving Definability Problems of Generalized Quantifiers

In recent years, generalized quantifiers (see [H3]) have received quite a lot of novel interest because of their applications to computer science and linguistics. Their definability theory has made considerable progress during the last decade, which will be the subject of the next section. The proofs of many of these results often use results of Ramsey theory, such as theorems of van der Waerde...

متن کامل

Generalized Quantifiers

We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011